Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3EERPAP
Repositorysid.inpe.br/sibgrapi/2013/07.13.04.02
Last Update2013:07.13.04.02.13 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2013/07.13.04.02.13
Metadata Last Update2022:06.14.00.07.56 (UTC) administrator
DOI10.1109/SIBGRAPI.2013.44
Citation KeyJiangSajaGopi:2013:SiDaLa
TitleSingle-Seek Data Layout for Walkthrough Applications
FormatOn-line.
Year2013
Access Date2024, May 02
Number of Files1
Size1207 KiB
2. Context
Author1 Jiang, Shan
2 Sajadi, Behzad
3 Gopi, M.
Affiliation1 University of California, Irvine
2 University of California, Irvine
3 University of California, Irvine
EditorBoyer, Kim
Hirata, Nina
Nedel, Luciana
Silva, Claudio
e-Mail Addresssjiang4@uci.edu
Conference NameConference on Graphics, Patterns and Images, 26 (SIBGRAPI)
Conference LocationArequipa, Peru
Date5-8 Aug. 2013
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2013-07-13 04:02:13 :: sjiang4@uci.edu -> administrator ::
2022-06-14 00:07:56 :: administrator -> :: 2013
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
KeywordsOut-Of-Core algorithms
Data Layouts
AbstractWith increasing speed of graphics rendering, the bottleneck in walkthrough applications has shifted to data transfer from secondary storage device to main memory. While techniques designed to reduce the data transfer volume and amortize the transfer cost are well-studied, the disk seek time, which is one of the most important components of the total rendering cost is not reduced explicitly. In this work, we propose an orthogonal approach to address the disk seek time bottleneck, namely single-seek data layouts. This is a solution in one end of the spectrum of solutions that guarantee an upper bound on the number of disk seeks. Using this approach, we can reduce the number of disk seeks required to load the data for any viewpoint in the scene to no more than one. We achieve this single seek layout using data redundancy. We provide a theoretical proof on the upper-bound of this redundancy factor, and analyze its trade-off with the rendering performance through an implementation that uses this data layout for walkthrough applications of datasets with hundreds of millions of triangles.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2013 > Single-Seek Data Layout...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Single-Seek Data Layout...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 13/07/2013 01:02 0.7 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3EERPAP
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3EERPAP
Languageen
Target Filesingleseek.pdf
User Groupsjiang4@uci.edu
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SLB4P
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.04.02 8
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close